Widely linear FRESH receivers for cancellation of data-like rectilinear and quasi-rectilinear interference with frequency offsets

نویسندگان

چکیده

Widely linear (WL) receivers have been developed in the past for single antenna interference cancellation (SAIC) of one rectilinear (R) or quasi-rectilinear (QR) data-like multi-user (MUI) co-channel (CCI) particular. The SAIC technology has implemented global system mobile communications (GSM) handsets particular and further analyzed voice services over adaptive channels on slot (VAMOS) standard. It remains great interest several current future applications using R QR signals, such as anti-collisions processing radio frequency identification (RFID) satellite-AIS systems to densify 5G Beyond (B5G) networks through dimensional signaling over-loaded large MU-MIMO systems. may be required cancel inter-symbol (ISI) control non-payload (CNPC) links unmanned aerial vehicles (UAV) inter-carrier (ICI) filter bank multi-carrier offset quadrature amplitude modulation (FBMC-OQAM), which are now candidate B5G networks. For these challenging applications, development enhanced WL filtering based Multiple Antenna Interference Cancellation (MAIC) signals interest. Such a receiver, corresponding three-input shift (FRESH) introduced recently signals. However this receiver is not robust MUI having residual (FO), occurs most previous applications. In context, paper first extends, arbitrary propagation channels, standards (for MUI) SAIC/MAIC with non-zero FO. Then, it shows less efficiency two-input FO performance improvement obtained receiver. Finally, analyzes, both analytically by simulations, MUI, impact proposed receivers. results should allow new powerful UAV CNPC links, AIS FBMC-OQAM

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence of linear interference cancellation multiuser receivers

We consider the convergence in norm of several iterative implementations of linear multiuser receivers, under the assumption of long random spreading sequences. We find that asymptotically, linear parallel interference cancellation diverges for systems loads of greater than about 17%. Using known results from the theory of iterative solutions for linear systems we derive optimal or near optimal...

متن کامل

How to Make Quasi-Rectilinear Signals (MSK, GMSK, OQAM) Almost Equivalent to Rectilinear Ones (BPSK, ASK) for Widely Linear Filtering in the Presence

Widely linear (WL) receivers are able to fulfill single antenna interference cancellation (SAIC) of one rectilinear (R) or quasi-rectilinear (QR) co-channel interference (CCI), a function which is operational in GSM handsets in particular. However, SAIC requires enhancements for QR signals, for both VAMOS standard, an evolution of GSM/EDGE standard, and FBMC-OQAM networks, which are candidate f...

متن کامل

Rectilinear Paths among Rectilinear Obstacles

Given a set of obstacles and two distinguished points in the plane the problem of nding a collision free path subject to a certain optimization function is a fundamental problem that arises in many elds, such as motion planning in robotics, wire routing in VLSI and logistics in operations research. In this survey we emphasize its applications to VLSI design and limit ourselves to the rectilinea...

متن کامل

Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods

We consider a setting where we are given a graph G = (R, E), where R = {R1, . . . , Rn} is a set of polygonal regions in the plane. Placing a point pi inside each region Ri turns G into an edge-weighted graph Gp , p = {p1, . . . , pn}, where the cost of (Ri, Rj) ∈ E is the distance between pi and pj . The Shortest Path Problem with Neighborhoods asks, for given Rs and Rt, to find a placement p ...

متن کامل

Rectilinear Path Problems among Rectilinear Obstacles Revisited

We present eecient algorithms for nding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for nding the shortest rectilinear path, the minimum-bend shortest rectilinear path, the shortest minimum-bend rectilinear path and the minimum-cost rectilinear path. For nding the shortest rectilinear...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Signal Processing

سال: 2021

ISSN: ['0165-1684', '1872-7557']

DOI: https://doi.org/10.1016/j.sigpro.2021.108171